Self-Monitoring with Reversible Grammars
نویسندگان
چکیده
We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances should be avoided our method is able to compute an unambiguous utterance for a given semantic input. The proposed method is based on a very strict integration of parsing and generation. During the monitored generation step, a previously generated (possibly) ambiguous utterance is parsed and the obtained alternative derivation trees are used as a 'guide' for re-generating the utterance. To achieve such an integrated approach the underlying grammar must be reversible.
منابع مشابه
Book Reviews: Reversible Grammar in Natural Language Processing
This is a collection of 15 revised and expanded papers from the 1991 Berkeley ACL workshop of the same title. Collectively, the contributions cover all the main theoretical and practical motivations for reversibility of grammars: increased accuracy of description gained; economy of development and maintenance effort; consistency of language use in translation or interface applications; and poss...
متن کاملReversibility and Self-monitoring in Natural Language Generation
This paper shows how the use of reversible grammars may lead to eecient and exible natural language parsing and generation systems. In particular a mechanism is described which ensures that only non-ambiguous utterances are produced. This mechanism uses the parsing component to monitor the generation component. The relevant communication between the two components is performed using derivation ...
متن کاملReversible Stochastic Attribute-Value Grammars
An attractive property of attribute-value grammars is their reversibility. Attribute-value grammars are usually coupled with separate statistical components for parse selection and fluency ranking. We propose reversible stochastic attribute-value grammars, in which a single statistical model is employed both for parse selection and fluency ranking.
متن کاملReversible Uni cation Based Machine Translation
In this paper it will be shown how uniication grammars can be used to build a reversible machine translation system. Uniication grammars are often used to deene the relation between strings and meaning representations in a declarative way. Such grammars are sometimes used in a bidirectional way, thus the same grammar is used for both parsing and generation. In this paper I will show how to use ...
متن کاملGenerating French with a Reversible Unification Grammar
O. Intr~cluction In this paper, we describe the linguistic solutions to some of the problems encountered in writing a reversible French grammar. This grammar is primarily intended to be one of the components of a machine translation system built using ELU, 1 an enhanced PATR-II style unification grammar linguistic environment based on the LID system described in Johnson and Rosner (1989), but i...
متن کامل